Realizability of Dynamic MSC Languages
نویسندگان
چکیده
We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can be described as sets of message sequence charts (MSCs). We consider the realizability problem for DCA: given a dynamic MSC grammar (a high-level MSC specification), is there a DCA defining the same set of MSCs? We show that this problem is EXPTIME-complete. Moreover, we identify a class of realizable grammars that can be implemented by finite DCA. V er si on : A u gu st 4, 20 10
منابع مشابه
Realizability and Verification of MSC Graphs
Scenario-based specifications such as message sequence charts (MSC) offer an intuitive and visual way to describe design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are undecidable for MSC-graphs in general, but are known to be dec...
متن کاملRealizability and Veri cation of MSC Graphs
Scenario-based speciications such as message sequence charts (MSC) ooer an intuitive and visual way of describing design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are known to be decidable for the class of bounded MSC-graphs. Our...
متن کاملRealizability Criteria for Compositional MSC
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic specifications, realizability criteria have been identified, such as non-local choice. In this work we develop a formal framework to study realizability of compositional MSC [GMP03]. We use it to derive a complete classif...
متن کاملOn the failure of BD- and BD, and an application to the anti-Specker property
We give the natural topological model for ¬BD-N, and use it to show that the closure of spaces with the anti-Specker property under product does not imply BD-N. Also, the natural topological model for ¬BD is presented. Finally, for some of the realizability models known indirectly to falsify BD-N, it is brought out in detail how BD-N fails. keywords: anti-Specker, BD, BD-N, realizability, topol...
متن کاملLifschitz realizability for intuitionistic Zermelo-Fraenkel set theory
A variant of realizability for Heyting arithmetic which validates Church’s thesis with uniqueness condition, but not the general form of Church’s thesis, was introduced by V. Lifschitz in [15]. A Lifschitz counterpart to Kleene’s realizability for functions (in Baire space) was developed by van Oosten [19]. In that paper he also extended Lifschitz’ realizability to second order arithmetic. The ...
متن کامل